Implicit iterative algorithm for solving regularized total least squares problems

The article considers a new iterative algorithm for solving total least squares problems. A version of the implicit method simple iterations based on singular value decomposition is proposed biased normal system algebraic equations. use makes it possible to replace an ill-conditioned problem with sequence problems smaller condition number. This significantly increase computational stability and, at same time, ensures its high rate convergence. Test examples shown that has higher accuracy compared solutions obtained by non-regularized algorithms, as well solution Tikhonov regularization.